Group-based image decomposition using 3-D cartoon and texture priors

نویسندگان

  • Tian-Hui Ma
  • Ting-Zhu Huang
  • Xi-Le Zhao
چکیده

We propose a novel image decomposition method to decompose an image into its cartoon and texture components. To exploit the nonlocal selfsimilarity of cartoon-plus-texture images, we construct groups by stacking together similar image patches into 3-D arrays and consider group as the basic unit of decomposition. We decompose each group via a convex optimization model consisting of 3-D cartoon and texture priors. These priors characterize the local properties of the cartoon and texture components and the nonlocal similarity within each component in a unified and natural manner. We develop the alternating direction method of multipliers (ADMM) to efficiently solve the proposed model. For further improvement, we investigate an adaptive rule for the estimation of the regularization parameter. The proposed method is also extended to tackle noisy images. Numerical experiments confirm that the performance of the proposed method is competitive with some of the state-of-the-art schemes.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Convolutional Sparse Coding-based Image Decomposition

We propose a novel sparsity-based method for cartoon and texture decomposition based on Convolutional Sparse Coding (CSC). Our method first learns a set of generic filters that can sparsely represent cartoon and texture type images. Then using these learned filters, we propose a sparsity-based optimization framework to decompose a given image into cartoon and texture components. By working dire...

متن کامل

Image Decomposition and Restoration Using Total Variation Minimization and the H−1 Norm∗

Abstract. In this paper, we propose a new model for image restoration and image decomposition into cartoon and texture, based on the total variation minimization of Rudin, Osher, and Fatemi [Phys. D, 60 (1992), pp. 259–268], and on oscillatory functions, which follows results of Meyer [Oscillating Patterns in Image Processing and Nonlinear Evolution Equations, Univ. Lecture Ser. 22, AMS, Provid...

متن کامل

Cartoon+Texture Image Decomposition

The algorithm first proposed in [3] stems from a theory proposed by Yves Meyer in [1]. The cartoon+texture algorithm decomposes any image f into the sum of a cartoon part, u , where only the image contrasted shapes appear, and a textural v part with the oscillating patterns. Such a decomposition f=u+v is analogous to the classical signal processing low pass-high pass filter decomposition. Howev...

متن کامل

Fast Single Image Super Resolution Reconstruction via Image Separation

In this work, a fast single image super resolution reconstruction (SRR) approach via image separation has been proposed. Based on the assumption that the edges, corners, and textures in the image have different mathematical models, we apply different image SRR algorithms to process them individually. Thus, our approach is divided into three steps: 1) separating the given image into cartoon and ...

متن کامل

Directional Filters for Cartoon + Texture Image Decomposition

We present in this article a detailed analysis and implementation of the cartoon+texture decomposition algorithm proposed in [A. Buades, J.L. Lisani, “Directional filters for color cartoon + texture image and video decomposition”, Journal of Mathematical Imaging and Vision, 2015]. This method follows the approach proposed by [A. Buades, T. Le, J-M. Morel, L. Vese, “Cartoon+Texture Image Decompo...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • Inf. Sci.

دوره 328  شماره 

صفحات  -

تاریخ انتشار 2016